Computational Geometry

Being a basic structure of computational geometry, convex hull is important to data analysis of GIS.

凸壳作为计算几何的一种基本的结构,对GIS的数据分析有着重要作用.

This Handbook provides an overview of key concepts and results in Computational Geometry.

这本手册提供核心概念的概述并且导致计算几何学.

In computational geometry, computing cross products is at the heart of line-segment methods.

叉积是计算几何中关于线段算法的核心.

In practice, ROC Convex Hull ( ROCCH ) method which combines techniques from computational geometry is used.

在实际应用中, 基于样本数据集,通过计算几何的方式得到ROC凸包曲线 ( ROCCH ) .

Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry.

摘要简单多边形凸单元剖分是计算几何的基本问题之一,剖分算法在许多领域均有较广泛的应用.

Minimum Manhattan network problem is put forward in 1999 a world-class computational geometry important conjecture.

最小曼哈顿网络问题,是1999年提出的 世界级 计算几何重要猜想.